Asynchronous Iterations for Enclosing Solutions Asynchronous Iterations for Enclosing Solutions
نویسنده
چکیده
We consider asynchronous, parallel iterations for calculating enclosures of solutions of systems of nonlinear equations in IR n. Particularly, we will show how two classical theorems on the monotone convergence of some iterative methods for certain classes of nonlinear equations carry over to the asynchronous case.
منابع مشابه
Enclosing Solutions of Linear Equations
It is shown that Rump’s method for enclosing solutions of linear equations can be reformulated in an interval–free form and that the underlying inclusion result can be proved by elementary means without using Brouwer’s fixed–point theorem. A sufficient condition on Rump’s “inflation parameter” ε is given under which finite termination occurs. Also, a more general modified algorithm is studied f...
متن کاملAsynchronous Exceptions in Concurrent Object-Oriented Programming
Exceptions in concurrent object-oriented languages with asynchronous call semantics may raise a serious problem in certain situations. Since separate calls are asynchronous it might happen that the context of the enclosing routine, from which the asynchronous call was launched, has been already left and hence any exception raised by the asynchronous call can not be handled anymore by the enclos...
متن کاملPerformance of Asynchronous Linear Iterations with Random Delays
In this paper we investigate the speedup potential of asynchronous iterative algorithms over their synchronous counterparts for the special case of linear iterations. The space of linear iterations of size two is explored by simulation and analytical methods. We find cases and conditions for high asynchronous speedups. However, averaging asynchronous speedups over the whole set of iteration mat...
متن کاملEfficient Approximation Algorithms for Minimum Enclosing Convex Shapes
We address the problem of Minimum Enclosing Ball (MEB) and its generalization to Minimum Enclosing Convex Polytope (MECP). Given n points in a d dimensional Euclidean space, we give a O(nd/ √ ) algorithm for producing an enclosing ball whose radius is at most away from the optimum. In the case of MECP our algorithm takes O(1/ ) iterations to converge. In both cases we improve the existing resul...
متن کاملOn Linear Asynchronous Iterations When the Spectral Radius of the Modulus Matrix Is One on Linear Asynchronous Iterations When the Spectral Radius of the Modulus Matrix Is One
A classical result on linear asynchronous iterations states that convergence occurs if and only if the spectral radius of the modulus matrix is less than 1. The present paper shows that if one introduces very mild restrictions on the admissible asynchronous processes, one gets convergence for a larger class of matrices for which the spectral radius of the modulus matrix is allowed to be equal t...
متن کامل